Sudoku into Exact Hitting Set
نویسنده
چکیده
I Exploratory data analysis I Presenting results in concise, meaningful graphs and tables I Basics of inferenzial statistics I Organization of Experiments (Experimental Design) I Sequential statistical testing: a methdology for tuning The goal of dealing with Experimental Algorithmics is not only producing a more correct analysis but adding an important tool to the development of a good, functioning solver for a given problem.
منابع مشابه
There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
The sudoku minimum number of clues problem is the following question: what is the smallest number of clues that a sudoku puzzle can have? For several years it had been conjectured that the answer is 17. We have performed an exhaustive computer search for 16-clue sudoku puzzles, and did not find any, thus proving that the answer is indeed 17. In this article we describe our method and the actual...
متن کاملThere is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem
We apply our new hitting set enumeration algorithm to solve the sudoku minimum number of clues problem, which is the following question: What is the smallest number of clues (givens) that a sudoku puzzle may have? It was conjectured that the answer is 17. We have performed an exhaustive search for a 16-clue sudoku puzzle, and we did not find one, thereby proving that the answer is indeed 17. Th...
متن کاملar X iv : 1 20 1 . 07 49 v 1 [ cs . D S ] 1 J an 2 01 2 There is no 16 - Clue Sudoku : Solving the Sudoku Minimum Number of Clues Problem
We apply our new hitting set enumeration algorithm to solve the sudoku minimum number of clues problem, which is the following question: What is the smallest number of clues (givens) that a sudoku puzzle may have? It was conjectured that the answer is 17. We have performed an exhaustive search for a 16-clue sudoku puzzle, and we did not find one, thereby proving that the answer is indeed 17. Th...
متن کاملHitting and Piercing Rectangles Induced by a Point Set
We consider various hitting and piercing problems for the family of axis-parallel rectangles induced by a point set. Selection Lemmas on induced objects are classical results in discrete geometry that have been well studied and have applications in many geometric problems like weak epsilon nets and slimming Delaunay triangulations. Selection Lemma type results typically bound the maximum number...
متن کاملThe Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment
We develop a novel framework, the implicit hitting set approach, for solving a class of combinatorial optimization problems. The explicit hitting set problem is as follows: given a set U and a family S of subsets of U , find a minimum-cardinality set that intersects (hits) every set in S. In the implicit hitting set problem (IHSP), the family of subsets S is not explicitly listed (its size is, ...
متن کامل